The solution and duality of imprecise network problems

Duality properties have been investigated by many researchers in the recent literature. They are introduced in this paper for a fully fuzzified version of the minimal cost flow problem, which is a basic model in network flow theory. This model illustrates the least cost of the shipment of a commodity through a capacitated network in terms of the imprecisely known available supplies at certain nodes which should be transmitted to fulfil uncertain demands at other nodes. First, we review on the most valuable results on fuzzy duality concepts to facilitate the discussion of this paper. By applying Hukuhara’s difference, approximated and exact multiplication and Wu’s scalar production, we exhibit the flow in network models. Then, we use combinatorial algorithms on a reduced problem which is derived from fully fuzzified MCFP to acquire fuzzy optimal flows. To give duality theorems, we utilize a total order on fuzzy numbers due to the level of risk and realize optimality conditions for providing some efficient combinatorial algorithms. Finally, we compare our results with the previous worthwhile works to demonstrate the efficiency and power of our scheme and the reasonability of our solutions in actual decision-making problems.     

Flexible decision tree for data stream classification in the presence of concept change, noise and missing values

In recent years, classification learning for data streams has become an important and active research topic. A major challenge posed by data streams is that their underlying concepts can change over time, which requires current classifiers to be revised accordingly and timely. To detect concept change, a common methodology is to observe the online classification accuracy. If accuracy drops below some threshold value, a concept change is deemed to have taken place. An implicit assumption behind this methodology is that any drop in classification accuracy can be interpreted as a symptom of concept change. Unfortunately however, this assumption is often violated in the real world where data streams carry noise that can also introduce a significant reduction in classification accuracy. To compound this problem, traditional noise cleansing methods are incompetent for data streams. Those methods normally need to scan data multiple times whereas learning for data streams can only afford one-pass scan because of data’s high speed and huge volume. Another open problem in data stream classification is how to deal with missing values. When new instances containing missing values arrive, how a learning model classifies them and how the learning model updates itself according to them is an issue whose solution is far from being explored. To solve these problems, this paper proposes a novel classification algorithm, flexible decision tree (FlexDT), which extends fuzzy logic to data stream classification. The advantages are three-fold. First, FlexDT offers a flexible structure to effectively and efficiently handle concept change. Second, FlexDT is robust to noise. Hence it can prevent noise from interfering with classification accuracy, and accuracy drop can be safely attributed to concept change. Third, it deals with missing values in an elegant way. Extensive evaluations are conducted to compare FlexDT with representative existing data stream classification algorithms using a large suite of data streams and various statistical tests. Experimental results suggest that FlexDT offers a significant benefit to data stream classification in real-world scenarios where concept change, noise and missing values coexist.     

A note on the learning automata based algorithms for adaptive parameter selection in PSO

PSO, like many stochastic search methods, is very sensitive to efficient parameter setting such that modifying a single parameter may cause a considerable change in the result. In this paper, we study the ability of learning automata for adaptive PSO parameter selection. We introduced two classes of learning automata based algorithms for adaptive selection of value for inertia weight and acceleration coefficients. In the first class, particles of a swarm use the same parameter values adjusted by learning automata. In the second class, each particle has its own characteristics and sets its parameter values individually. In addition, for both classed of proposed algorithms, two approaches for changing value of the parameters has been applied. In first approach, named adventurous, value of a parameter is selected from a finite set while in the second approach, named conservative, value of a parameter either changes by a fixed amount or remains unchanged. Experimental results show that proposed learning automata based algorithms compared to other schemes such as SPSO, PSOIW, PSO-TVAC, PSOLP, DAPSO, GPSO, and DCPSO have the same or even higher ability to find better solutions. In addition, proposed algorithms converge to stopping criteria for some of the highly multi modal functions significantly faster.     

Decision making in dynamic stochastic Cournot games

In this paper, the Cournot competition is modeled as a stochastic dynamic game. In the proposed model, a stochastic market price function and stochastic dynamic decision functions of the rivals are considered. Since the optimal decision of a player needs the estimation of the unknown parameters of the market and rivals’ decisions, a combined estimation-optimization algorithm for decision making is proposed. The history of the rivals’ output quantities (supplies) and the market clearing price (MCP) are the only available information to the players. The convergence of the algorithm (for both estimation and decision making processes) is discussed. In addition, the stability conditions of the equilibrium points are analyzed using the converse Lyapunov theorem. Through the case studies, which are performed based on the California Independent System Operator (CA-ISO) historical public data, the theoretical results and the applicability of the proposed method are verified. Moreover, a comparative study among the agents using the proposed method, naïve expectation and adaptive expectation in the market is performed to show the effectiveness and applicability of the proposed method.     

Model-based PI–fuzzy control of four-wheeled omni-directional mobile robots

The purpose of this study is to suggest and examine a PI–fuzzy path planner and associated low-level control system for a linear discrete dynamic model of omni-directional mobile robots to obtain optimal inputs for drivers. Velocity and acceleration filtering is also implemented in the path planner to satisfy planning prerequisites and prevent slippage. Regulated drivers’ rotational velocities and torques greatly affect the ability of these robots to perform trajectory planner tasks. These regulated values are examined in this research by setting up an optimal controller. Introducing optimal controllers such as linear quadratic tracking for multi-input–multi-output control systems in acceleration and deceleration is one of the essential subjects for motion control of omni-directional mobile robots. The main topics presented and discussed in this article are improvements in the presented discrete-time linear quadratic tracking approach such as the low-level controller and combined PI–fuzzy path planner with appropriate speed monitoring algorithm such as the high-level one in conditions both with and without external disturbance. The low-level tracking controller presented in this article provides an optimal solution to minimize the differences between the reference trajectory and the system output. The efficiency of this approach is also compared with that of previous PID controllers which employ kinematic modeling. Utilizing the new approach in trajectory-planning controller design results in more precise and appropriate outputs for the motion of four-wheeled omni-directional mobile robots, and the modeling and experimental results confirm this issue.     

Algorithm for Increasing the Speed of Evolutionary Optimization and its Accuracy in Multi-objective Problems

Optimization algorithms are important tools for the solution of combinatorial management problems. Nowadays, many of those problems are addressed by using evolutionary algorithms (EAs) that move toward a near-optimal solution by repetitive simulations. Sometimes, such extensive simulations are not possible or are costly and time-consuming. Thus, in this study a method based on artificial neural networks (ANN) is proposed to reduce the number of simulations required in EAs. Specifically, an ANN simulator is used to reduce the number of simulations by the main simulator. The ANN is trained and updated only for required areas in the decision space. Performance of the proposed method is examined by integrating it with the non-dominated sorting genetic algorithm (NSGAII) in multi-objective problems. In terms of density and optimality of the Pareto front, the hybrid NSGAII-ANN is able to extract the Pareto front with much less simulation time compared to the sole use of the NSGAII algorithm. The proposed NSGAII-ANN methodology was examined using three standard test problems (FON, KUR, and ZDT1) and one real-world problem. The latter addresses the operation of a reservoir with two objectives (meeting demand and flood control). Thus, based on this study, use of the NSGAII-ANN integrative algorithm in problems with time-consuming simulators reduces the required time for optimization up to 50 times. Results of the real-world problem, despite lower computational-time requirements, show a performance similar to that achieved in the aforementioned test problems.     

Predicting the spontaneous termination of atrial fibrillation based on poincare section in the electrocardiogram phase space

Atrial fibrillation (AF) is a commonly encountered cardiac arrhythmia. Predicting the conditions under which AF terminates spontaneously is an important task that would bring great benefit to both patients and clinicians. In this study, a new method was proposed to predict spontaneous AF termination by employing the points of section (POS) coordinates along a Poincare section in the electrocardiogram (ECG) phase space. The AF Termination Database provided by PhysioNet for the Computers in Cardiology Challenge 2004 was applied in the present study. It includes one training dataset and two testing datasets, A and B. The present investigation was initiated by producing a two-dimensional reconstructed phase space (RPS) of the ECG. Then, a Poincare line was drawn in a direction that included the maximum point distribution in the RPS and also passed through the origin of the RPS coordinate system. Afterward, the coordinates of the RPS trajectory intersections with this Poincare line were extracted to capture the local behavior related to the arrhythmia under investigation. The POS corresponding to atrial activity were selected with regard to the fact that similar ECG morphologies such as P waves, which are corresponding to atrial activity, distribute in a specific region of the RPS. Thirteen features were extracted from the selected intersection points to quantify their distributions. To select the best feature subset, a genetic algorithm (GA), in combination with a support vector machine (SVM), was applied to the training dataset. Based on the selected features and trained SVM, the performance of the proposed method was evaluated using the testing datasets. The results showed that 86.67% of dataset A and 80% of dataset B were correctly classified. This classification accuracy is in the same range as or higher than that of recent studies in this area. These results show that the proposed method, in which no complicated QRST cancelation algorithm was used, has the potential to predict AF termination.     

Adaptive neural dynamic surface control of MIMO nonlinear time delay systems with time‐varying actuator failures

In this paper, an adaptive dynamic surface control approach is developed for a class of multi‐input multi‐output nonlinear systems with unknown nonlinearities, bounded time‐varying state delays, and in the presence of time‐varying actuator failures. The type of the considered actuator failure is that some unknown inputs may be stuck at some time‐varying values where the values, times, and patterns of the failures are unknown. The considered actuator failure can cover most failures that may occur in actuators of the systems. With the help of neural networks to approximate the unknown nonlinear functions and combining the dynamic surface control approach with the backstepping design method, a novel control approach is constructed. The proposed design method does not require a priori knowledge of the bounds of the unknown time delays and actuator failures. The boundedness of all the closed‐loop signals is guaranteed, and the tracking errors are proved to converge to a small neighborhood of the origin. The proposed approach is employed for a double inverted pendulums benchmark as well as a chemical reactor system. The simulation results show the effectiveness of the proposed method. Copyright © 2016 John Wiley & Sons, Ltd.